A remark on the (2, 2)-domination number
نویسندگان
چکیده
A subset D of the vertex set of a graph G is a (k, p)-dominating set if every vertex v ∈ V (G) \ D is within distance k to at least p vertices in D. The parameter γk,p(G) denotes the minimum cardinality of a (k, p)-dominating set of G. In 1994, Bean, Henning and Swart posed the conjecture that γk,p(G) ≤ p p+k n(G) for any graph G with δk(G) ≥ k + p − 1, where the latter means that every vertex is within distance k to at least k + p − 1 vertices other than itself. In 2005, Fischermann and Volkmann confirmed this conjecture for all integers k and p for the case that p is a multiple of k. In this paper we show that γ2,2(G) ≤ (n(G)+1)/2 for all connected graphs G and characterize all connected graphs with γ2,2 = (n+1)/2. This means that for k = p = 2 we characterize all connected graphs for which the conjecture is true without the precondition that δ2 ≥ 3.
منابع مشابه
A Remark on Total Domination Critical Graphs
A graph G with no isolated vertex is total domination vertex critical if for any vertex v of G that is not adjacent to a vertex of degree one, the total domination number of G− v is less than the total domination number of G. We call these graphs γt-critical. In this paper, we disprove a conjecture posed in a recent paper(On an open problem concerning total domination critical graphs, Expo. Mat...
متن کاملA remark on the means of the number of divisors
We obtain the asymptotic expansion of the sequence with general term $frac{A_n}{G_n}$, where $A_n$ and $G_n$ are the arithmetic and geometric means of the numbers $d(1),d(2),dots,d(n)$, with $d(n)$ denoting the number of positive divisors of $n$. Also, we obtain some explicit bounds concerning $G_n$ and $frac{A_n}{G_n}$.
متن کاملOn the super domination number of graphs
The open neighborhood of a vertex $v$ of a graph $G$ is the set $N(v)$ consisting of all vertices adjacent to $v$ in $G$. For $Dsubseteq V(G)$, we define $overline{D}=V(G)setminus D$. A set $Dsubseteq V(G)$ is called a super dominating set of $G$ if for every vertex $uin overline{D}$, there exists $vin D$ such that $N(v)cap overline{D}={u}$. The super domination number of $G$ is the minimum car...
متن کاملSome Results on the Maximal 2-Rainbow Domination Number in Graphs
A 2-rainbow dominating function ( ) of a graph is a function from the vertex set to the set of all subsets of the set such that for any vertex with the condition is fulfilled, where is the open neighborhood of . A maximal 2-rainbow dominating function on a graph is a 2-rainbow dominating function such that the set is not a dominating set of . The weight of a maximal is the value . ...
متن کاملLower bounds on the signed (total) $k$-domination number
Let $G$ be a graph with vertex set $V(G)$. For any integer $kge 1$, a signed (total) $k$-dominating functionis a function $f: V(G) rightarrow { -1, 1}$ satisfying $sum_{xin N[v]}f(x)ge k$ ($sum_{xin N(v)}f(x)ge k$)for every $vin V(G)$, where $N(v)$ is the neighborhood of $v$ and $N[v]=N(v)cup{v}$. The minimum of the values$sum_{vin V(G)}f(v)$, taken over all signed (total) $k$-dominating functi...
متن کاملOn the signed Roman edge k-domination in graphs
Let $kgeq 1$ be an integer, and $G=(V,E)$ be a finite and simplegraph. The closed neighborhood $N_G[e]$ of an edge $e$ in a graph$G$ is the set consisting of $e$ and all edges having a commonend-vertex with $e$. A signed Roman edge $k$-dominating function(SREkDF) on a graph $G$ is a function $f:E rightarrow{-1,1,2}$ satisfying the conditions that (i) for every edge $e$of $G$, $sum _{xin N[e]} f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discussiones Mathematicae Graph Theory
دوره 28 شماره
صفحات -
تاریخ انتشار 2008